Non-uniform lattices on uniform trees

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lattices on Non-uniform Trees

Let X be a locally finite tree, and let G = Aut(X). Then G is a locally compact group. We show that if X has more than one end, and if G contains a discrete subgroup Γ such that the quotient graph of groups Γ\\X is infinite but has finite covolume, then G contains a non-uniform lattice, that is, a discrete subgroup Λ such that Λ\G is not compact, yet has a finite G-invariant measure. 0. Notatio...

متن کامل

Lattices of Minimum Covolume Are Non-uniform

In this article, we prove that a lattice of minimum covolume in a simple Lie group over a positive characteristic local field is non-uniform if the Weil’s conjecture on Tamagawa numbers [Wei61] holds. This, in part, answers Lubotzky’s conjecture [Lub91]

متن کامل

Dense packing on uniform lattices

We study the Hard Core Model on the graphs G obtained from Archimedean tilings i.e. configurations in {0,1} with the nearest neighbor 1’s forbidden. Our particular aim in choosing these graphs is to obtain insight to the geometry of the densest packings in a uniform discrete set-up. We establish density bounds, optimal configurations reaching them in all cases, and introduce a probabilistic cel...

متن کامل

Congruence Lattices of Uniform Lattices

A lattice L is uniform, if for any congruence Θ of L, any two congruence classes A and B of Θ are of the same size, that is, |A| = |B| holds. A classical result of R. P. Dilworth represents a finite distributive lattice D as the congruence lattice of a finite lattice L. We show that this L can be constructed as a finite uniform lattice.

متن کامل

Non-Uniform Random Spanning Trees on Weighted Graphs

We study random walks on undirected graphs with weighted edges. Our main result shows that any spanning tree deened by the edges corresponding to a rst visit of a vertex, appears with a probability proportional to its weight, which is the product of the weights of its edges. This provides an algorithm for generating non uniform random spanning trees in a weighted graph. The technique used here ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Memoirs of the American Mathematical Society

سال: 2001

ISSN: 0065-9266,1947-6221

DOI: 10.1090/memo/0724